Intelligent computer memory management

ABSTRACT

A plurality of memory allocators are initialized within a computing system. At least a first memory allocator and a second memory allocator in the plurality of memory allocators are each customizable to efficiently handle a set of different memory request size distributions. The first memory allocator is configured to handle a first memory request size distribution. The second memory allocator is configured to handle a second memory request size distribution. The second memory request size distribution is different than the first memory request size distribution. At least the first memory allocator and the second memory allocator that have been configured are deployed within the computing system in support of at least one application. Deploying at least the first memory allocator and the second memory allocator within the computing system improves at least one of performance and memory utilization of the at least one application.

FIELD OF THE INVENTION

The present invention generally relates to computer memory, and moreparticularly relates to managing computer memory.

BACKGROUND OF THE INVENTION

Dynamic memory allocation is generally used for managing memorydynamically at run time. Dynamic memory allocation can be used forallocating space for objects whose sizes and lifetimes are not knownstatically (i.e. at compile time). Unfortunately, dynamic memoryallocators incur both execution time overhead and space overhead. Withinsome object oriented computer languages such as C and C++, dynamicmemory allocation is achieved by functions such as malloc and free.However, such functions are not always sufficient. For example, theperformance of these types of functions might not be sufficient for aparticular application. Also, these types of functions generally do notprovide garbage collection or persistent storage allocation innonvolatile memory (e.g. disk storage).

SUMMARY OF THE INVENTION

In one embodiment, a method for managing computer memory is disclosed.The method comprises initializing a plurality of memory allocatorswithin a computing system. At least a first memory allocator and asecond memory allocator in the plurality of memory allocators are eachcustomizable to efficiently handle a set of different memory requestsize distributions. The first memory allocator is configured to handle afirst memory request size distribution. The second memory allocator isconfigured to handle a second memory request size distribution. Thesecond memory request size distribution is different than the firstmemory request size distribution. At least the first memory allocatorand the second memory allocator that have been configured are deployedwithin the computing system in support of at least one application.Deploying at least the first memory allocator and the second memoryallocator within the computing system improves at least one ofperformance and memory utilization of the at least one application.

In another embodiment, another method for managing computer memory isdisclosed. The method comprises initializing a memory allocator in acomputing system. The memory allocator allocates a plurality of mainmemory objects. At least one main memory object in the plurality of mainmemory objects is backed up in persistent storage utilizing a backupoperation. Input-output bandwidth being consumed for storing informationin the persistent storage is monitored. The backup operation is modifiedbased on monitoring the bandwidth being consumed.

In yet another embodiment, a method for managing computer memory isdisclosed. The method comprises initializing at least one memoryallocator within a computing system. The at least one memory allocatoris deployed on a multi-user system where users are charged a monetaryfee based on consumption of resources thereby. A consumption of at leastone of a set of memory resources and a set of persistent storageresources by a user is determined by the memory allocator. A costassociated with the consumption that has been determined is determinedby the memory allocator. A monetary fee to charge the user is determinedbased on the cost that has been determined.

In yet another embodiment, a method for managing computer memory isdisclosed. The method comprises initializing, which a computing system,a memory allocator. The memory allocator utilizes at least one memoryallocation method to allocate memory for the computing system. A set ofmemory requests made by the computing system is monitored. The at leastone memory allocation method utilized by the memory allocator isdynamically modified in response to the set of memory requests that hasbeen monitored. This improves at least one of performance and memoryutilization of the at least one application.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying figures where like reference numerals refer toidentical or functionally similar elements throughout the separateviews, and which together with the detailed description below areincorporated in and form part of the specification, serve to furtherillustrate various embodiments and to explain various principles andadvantages all in accordance with the present invention, in which:

FIG. 1 is a block diagram illustrating one example of an operatingenvironment according to one embodiment of the present invention;

FIG. 2 shows one example of external fragmentation with respect tocomputer memory;

FIG. 3 shows one example of a memory blocks for illustrating a first fitmemory allocation technique according to one embodiment of the presentinvention;

FIG. 4 illustrates a binary buddy system for use with one memoryallocation technique according to one embodiment of the presentinvention;

FIG. 5 illustrates a quick fit system for use with one memory allocationtechnique according to one embodiment of the present invention;

FIG. 6 illustrates a filler block for use with one memory allocationtechnique according to one embodiment of the present invention; and

FIGS. 7-9 are operational flow diagrams illustrating various processesfor managing computer memory according to one embodiment of the presentinvention.

DETAILED DESCRIPTION

As required, various detailed embodiments of the present invention aredisclosed herein; however, it is to be understood that various disclosedembodiments are merely exemplary of the invention, which can be embodiedin various forms. Therefore, specific structural and functional detailsdisclosed herein are not to be interpreted as limiting, but merely as abasis for the claims and as a representative basis for teaching oneskilled in the art to variously employ the present invention invirtually any appropriately detailed structure. Further, the terms andphrases used herein are not intended to be limiting; but rather, toprovide an understandable description of the invention.

The terms “a” or “an”, as used herein, are defined as one as or morethan one. The term plurality, as used herein, is defined as two as ormore than two. Plural and singular terms are the same unless expresslystated otherwise. The term another, as used herein, is defined as atleast a second or more. The terms including and/or having, as usedherein, are defined as comprising (i.e., open language). The termcoupled, as used herein, is defined as connected, although notnecessarily directly, and not necessarily mechanically. The termsprogram, software application, and the like as used herein, are definedas a sequence of instructions designed for execution on a computersystem. A program, computer program, or software application may includea subroutine, a function, a procedure, an object method, an objectimplementation, an executable application, an applet, a servlet, asource code, an object code, a shared library/dynamic load libraryand/or other sequence of instructions designed for execution on acomputer system.

FIG. 1 shows an exemplary operating environment applicable to variousembodiments of the present invention. In particular, FIG. 1 shows aninformation processing system 100 that is based upon a suitablyconfigured processing system adapted to implement one or moreembodiments of the present invention. Similarly, any suitably configuredprocessing system can be used as the information processing system 100by various embodiments of the present invention. The system 100 can be astandalone system or reside within a multi-system environment such as aparallel-distributing environment.

The information processing system 100 includes a computer 102. Thecomputer 102 has a processor(s) 104 that is connected to a main memory106, a mass storage interface 108, and network adapter hardware 110. Asystem bus 112 interconnects these system components. The main memory106, in one embodiment, comprises an intelligent memory manager 120 andone or more memory allocators 122, which are discussed in greater detailbelow. Although illustrated as concurrently resident in the main memory106, it is clear that respective components of the main memory 106 arenot required to be completely resident in the main memory 3106 at alltimes or even at the same time. In one embodiment, the informationprocessing system 100 utilizes conventional virtual addressingmechanisms to allow programs to behave as if they have access to alarge, single storage entity, referred to herein as a computer systemmemory, instead of access to multiple, smaller storage entities such asthe main memory 106 and mass storage device 114. Note that the term“computer system memory” is used herein to generically refer to theentire virtual memory of the information processing system 100.

The mass storage interface 110 is used to connect mass storage devices,such as mass storage device 116, to the information processing system100. One specific type of data storage device is an optical drive suchas a CD/DVD drive, which may be used to store data to and read data froma computer readable medium or storage product such as (but not limitedto) a CD/DVD 116. Another type of data storage device is a data storagedevice configured to support, for example, NTFS type file systemoperations.

Although only one CPU 104 is illustrated for computer 102, computersystems with multiple CPUs can be used equally effectively. Variousembodiments of the present invention further incorporate interfaces thateach includes separate, fully programmed microprocessors that are usedto off-load processing from the CPU 104. An operating system (not shown)included in the main memory is a suitable multitasking operating systemsuch as any of the Linux, UNIX, Windows, and Windows Server basedoperating systems. Various embodiments of the present invention are ableto use any other suitable operating system. Some embodiments of thepresent invention utilize architectures, such as an object orientedframework mechanism, that allows instructions of the components ofoperating system (not shown) to be executed on any processor locatedwithin the information processing system 100. The network adapterhardware 110 is used to provide an interface to a network 118. Variousembodiments of the present invention are able to be adapted to work withany data communications connections including present day analog and/ordigital techniques or via a future networking mechanism.

Various embodiments of the present invention provide customized memoryallocation that can be tailored to individual applications via the IMM120. The IMM 120 provides a variety of memory allocation configurationsincluding, but not limited to, first fit, best fit, multiple free listfit I, multiple free list fit II, quick fit, and buddy systems. See, forexample, “Scalability of Dynamic Storage Allocation Algorithms”, ArunIyengar, Proceedings of Frontiers '96, herein incorporated by referencein its entirety. Therefore, if an application has very specific memoryallocation requirements, the IMM 120 can handle it efficiently.

Memory allocators should make efficient use of memory. However,conventional memory allocators typically waste memory due to internaland external fragmentation. Internal fragmentation occurs when a requestis satisfied by a larger block than is necessary. For example, if arequest for a block of 17 bytes is satisfied by a block of 32 bytes, 15bytes are wasted due to internal fragmentation. External fragmentationoccurs when memory is wasted due to allocated blocks being interspersedwith free blocks. For example, in FIG. 2, the system cannot satisfy arequest larger than 14, even though 24 bytes are free. This is becausethe 24 bytes are not contiguous. For example, FIG. 2 shows that a firstblock 202 comprises 14 free bytes, a second block 204 comprises 12allocated bytes, and a third block 206 comprises 10 free bytes. As canbe seen, the first and third blocks 202, 206 are not contiguous.

Multiple methods for allocating memory can be used by the IMM 120. Oneexample is a first fit technique. Another example is best fit technique.In a first fit system, the first block found that is large enough tosatisfy the request is used. For example, in FIG. 3 shows a plurality ofblocks 302, 304, 306, 308, 310 each comprises a given number of bytesshown in parenthesis. A first fit search of the list for a block of size9 returns block B2 304. In a best fit system, a smallest block largeenough to satisfy the request is used. Therefore, using the exampleshown in FIG. 2 a best fit search returns block B4 308. First fit hasthe advantage of generally being faster. Best fit has the advantage ofgenerally wasting less memory. Best fit usually results in better memoryutilization even in situations in which the memory allocator splitsallocated blocks to minimize internal fragmentation.

Another possible memory allocation system that the IMM 120 can use is abuddy system. FIG. 4 illustrates a binary buddy system. In a buddysystem memory is split in half to try and obtain a best fit. Forexample, FIG. 4 shows a plurality of blocks 402 each with a block sizethat is a power of 2, as shown by box 404. In other words, memory isallocated in powers of 2. When a free list block does not exist a fillerblock 406 can be used to satisfy the memory request. Yet another memoryallocation system that the IMM 120 can use is quick fit. In a quick fitsystem (such as the one shown in FIG. 5), separate free lists (a freelist is a list containing free blocks 502) known as quick lists existfor free blocks, which is a multiple of a grain size (up to a maximumsize; the grain size in FIG. 5 is 512 as shown in box 504). This resultsin fast allocation for block sizes corresponding to quick lists.

FIG. 5 also shows a filler block 506 (sometimes referred to as a tail).When quick fit is used, all of the quick lists are initially empty. If aquick list for a block of size n is empty, the block of size n isobtained from the filler block. The filler block then decreases in sizeby n. Allocation from the filler block is fast. After the block isde-allocated, it is stored on the appropriate quick list. This is themanner by which quick lists become populated.

A very fast memory allocation embodiment is shown in FIG. 6. In thismemory allocation embodiment, memory is simply allocated from the fillerblock 602 and is never de-allocated. While this approach is fast, itruns out of memory quickly for applications that perform manyallocations. For applications that run out of memory using thisapproach, one of the earlier schemes that wastes less memory is morebeneficial. It should be noted that a wide variety of other memoryallocation methods can be used by one or more embodiments of the presentinvention.

One advantage of various embodiments of the present invention is thatmemory allocation methods can be tailored to the needs of specificapplications. For example, if an application makes a high percentage ofmemory allocation requests for blocks of sizes 90,901; 2,007; 255,345;and 9,567,891, special free lists can be allocated specifically forthese sizes. In general, it may not be advisable to have special freelists for those particular sizes because an application would beunlikely to request many blocks of those sizes. If the application isknown to request many blocks corresponding to these sizes, then the IMM120 provides a memory allocator 122 with free lists specifically forblocks of these sizes for that application. For other applications, theIMM 120 utilizes different allocation configurations without free listsspecifically for the sizes 90,901; 2,007; 255,345; and 9,567,891. Thisillustrates how the IMM 120 can provide specific memory allocationmethods for particular applications.

Another advantage of various embodiments of the present invention isthat they allow multiple memory allocators, m₁, m₂, m₃, . . . , m_(n),to operate either in parallel or at separate times. The use of multiplememory allocators 122 allows different memory mangers to be tailored todifferent application needs. For example, the system 100 might have anapplication that almost never requests blocks of size larger than 20. Inthis case, a memory allocator m₁ optimized for allocating small blocksis appropriate. Another application might have a high percentage ofrequests for blocks larger than size 1000. A different memory allocatorm₂ might be appropriate for this type of application. If theapplications are running concurrently on the same system, having m₁ andm₂ executing concurrently is important. It can also be the case that asingle application might execute more efficiently if it uses multiplememory allocators to handle different allocation needs that it may have.Thus, the ability to use multiple memory allocators is advantageous.

Programmers have the ability to customize memory allocation in severalways. These include, but are not limited to the following: (1) pickingan implementation of a particular memory allocation algorithm, such asfirst fit, best fit, multiple free list fit I, multiple free list fitII, quick fit, a buddy system, etc; (2) tailoring free list allocationsto certain request sizes. For example, it was discussed above how freelists for specific block sizes could be used in a memory allocator; and(3) using multiple memory allocators concurrently, each tailored todifferent memory allocation needs.

In addition, the IMM 120 has the ability to monitor memory allocationand de-allocation requests from executing programs and determine requestpatterns. Based on the request patterns, the IMM 120 can select anappropriate memory allocation configuration. For example, if the IMM 120determines that a program is requesting block sizes that are powers of2, it can use a binary buddy system for that program. If the IMM 120determines that almost all request sizes are less than or equal to 30,it can use a quick fit system with quick lists for blocks up to size 30.

One advantage of having the IMM 120 monitor requests and selectappropriate memory allocation methods based on the requests is that theuser does not have to make the choices. The IMM 120 can make the choiceof an appropriate memory manager automatically. This makes theprogrammer/user's job easier. It can also allow the IMM 120 to makeintelligent choices about memory management at run time based oninformation that the user might not have. This can lead to betterperformance than is otherwise be possible.

The use of multiple memory managers also allows all memory objectscorresponding to a memory manager to be de-allocated at once. Users havethe ability to de-allocate all memory objects belonging to a particularmemory manager, m₁, in a single command. This provides some degree ofgarbage collection. A programmer can allocate a set of objects in amemory manager m₁. At a later point, the programmer can request that allmemory objects in m1 be de-allocated.

By contrast, in programming languages such as C and C++ in which memoryis allocated dynamically using malloc and de-allocated using free, thereis no easy way to de-allocate a group of dynamically allocated objectsat once. Instead, programmers typically keep track of individualobjects. When it is time to de-allocate a particular object o₁, o₁ isexplicitly de-allocated by a call to free. Programmers explicitlyde-allocate each object by calls to free. If a programmer mistakenlyde-allocates an object which should not have been de-allocated, this cancause the program to function incorrectly. If, on the other hand, aprogrammer fails to free objects that should be de-allocated, this canlead to memory leaks in which the program consumes more memory than itshould. If the memory leak problem is serious, this can greatly decreasethe performance of the system and even cause it to cease to functioneffectively. Therefore, there is a need for one or more embodiments ofthe present invention that provides more powerful methods ofde-allocating multiple objects.

Another advantage of the IMM 120 is that it provides flexible optionsfor backing up main memory objects in persistent storage. Persistentstorage is important for keeping data around for long periods of time.Data in persistent storage continues to exist after a program stopsexecuting (or crashes), for example. File systems and databasemanagement systems (DBMS) are two examples of persistent storage. Thisaspect also distinguishes one or more embodiments of the presentinvention from dynamic memory management via malloc and free. Malloc andfree do not provide capabilities for backing up main memory objects inpersistent storage. Instead, programmers are responsible for writingtheir own code to back up main memory objects in persistent storage.

With respect to backing up memory objects on disk, there is a trade-offbetween performance and level of consistency of copies of objects. Ifobjects are backed up on disk frequently, this improves consistency.However, it also has higher overhead that can adversely affectperformance. If objects are backed up on disk less frequently, thisintroduces less overhead that can improve performance.

The options provided by the IMM 120 for backing up memory objects inpersistent storage include, but are not limited to (1) store object o₁in persistent storage whenever o₁ changes (e.g., a value associated witho₁ changes); (2) store object o₁ in persistent storage whenever theversion of o₁ in persistent storage has been obsolete for a time periodexceeding a threshold; and (3) store object o₁ on disk whenever thenumber of updates to o₁ since the last version of o₁ stored inpersistent storage exceeds a threshold.

The IMM 120 provides is dynamic adjustment of how memory objects arebacked up in persistent storage in response to run-time conditions. Whenthere is sufficient I/O bandwidth between main memory and persistentstorage that is not being used, the IMM 120 can back up memory objectsmore frequently. When the I/O channels between main memory and disk areheavily used and on the verge of becoming a bottleneck, the IMM 120reduces the frequency by which memory objects are backed up inpersistent storage. Since the IMM 120 can monitor I/O usage and makedecisions dynamically based on spare I/O capacity, this simplifies theprogrammer's job and allows the system to achieve an optimal balancebetween performance and level of consistency of objects backed up inpersistent storage.

Using this feature, the IMM 120 often reduces the frequency with whichobjects are backed up in persistent storage in response to more I/Obandwidth being consumed for storing (and/or reading) data in persistentstorage. Conversely, the IMM 120 often increases the frequency withwhich objects are backed up in persistent storage in response to lessI/O bandwidth being consumed for storing (and/or reading) data inpersistent storage. The IMM 120 also can monitor the amount of memoryand persistent storage taken up by a user. The IMM 120 can provide awide variety of statistics on memory and storage usage.

The IMM 120 also has features for environments in which the usage ofmemory (and/or persistent storage) for individual users needs to becarefully tracked and monitored. For example, in multi-user and/or cloudcomputing environments, there may be many users of a system. A givenuser may have constraints on how much memory he/she is allowed to use.In addition, the user might be billed for usage of the platform. A fairbilling system would consider how much memory and/or persistent storageis being used to bill the customer. For these types of environments, theIMM 120 has the capability to restrict the amount of memory (or storage)a user requests. When the user reaches his/her quota, he/she cannotreceive more memory/storage.

The IMM 120 also allows costs to be assigned to a user based on how theuser uses memory (and/or persistent storage). The simplest costcalculation approach is to assign a cost that increases linearly withthe amount of memory being consumed. However, other cost calculationmethods are also provided. For example, during peak usage periods,higher costs can be assigned for memory utilization than during periodswhen the system is not being used as much. This can encourage people touse the system during less busy times. Another cost calculation methodis to assign low costs if the user maintains memory (storage) usagebelow a certain threshold. After the user exceeds the threshold, costsrise considerably. Additionally factors can be taken into account forcharging users. Memory (storage) utilization is only be one factor.Input from the IMM 120 is one of several things that can affect thetotal amount that is billed to a user.

The IMM 120, in one embodiment, can be implemented in a programminglanguage such as C++. In this embodiment, a class referred to asMemoryManager implements key functions for memory management. A memoryallocator can be comprised of an object belonging to the MemoryManagerclass. Multiple memory allocators can be created by creating multipleMemoryManager objects. Many other implementations are possible withinthe spirit and scope of the invention. It should be noted that the IMM120 can be implemented in other programming languages as well.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of various embodiments of the present invention are describedbelow with reference to flowchart illustrations and/or block diagrams ofmethods, apparatus (systems) and computer program products according toone or more embodiments of the invention. It will be understood thateach block of the flowchart illustrations and/or block diagrams, andcombinations of blocks in the flowchart illustrations and/or blockdiagrams, can be implemented by computer program instructions. Thesecomputer program instructions may be provided to a processor of ageneral purpose computer, special purpose computer, or otherprogrammable data processing apparatus to produce a machine, such thatthe instructions, which execute via the processor of the computer orother programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

Referring now to FIGS. 7-9, the flowcharts and block diagrams in theFigures illustrate the architecture, functionality, and operation ofpossible implementations of systems, methods, and computer programproducts according to various embodiments of the present invention. Inthis regard, each block in the flowchart or block diagrams may representa module, segment, or portion of code, which comprises one or moreexecutable instructions for implementing the specified logicalfunction(s). It should also be noted that, in some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts, or combinations of special purpose hardware andcomputer instructions.

FIG. 7 is an operational flow diagram illustrating one example ofmanaging computer memory, as discussed above. The operational flow ofFIG. 7 begins at step 702 and flows directly into step 704. Theintelligent memory manager 120, at step 704, initializes multipleallocators 122 within a system 100. The intelligent memory manager 120,at step 706, determines that memory requests of different sizes arebeing received. The intelligent memory manager 120, at step 708,configures a first memory allocator to handle a first memory requestsize distribution based on memory requests of different sizes are beingreceived. The intelligent memory manager 120, at step 710, configures asecond memory allocator to handle a second memory request sizedistribution based on memory requests of different sizes are beingreceived. The intelligent memory manager 120, at step 712, deploys atleast the first memory allocator and the second memory allocator withinthe system. The control flow then exits at step 714.

FIG. 8 is an operational flow diagram illustrating another example ofmanaging computer memory, as discussed above. The operational flow ofFIG. 8 begins at step 802 and flows directly into step 804. Theintelligent memory manager 120, at step 804, initializes a memoryallocator 122 in a system 100. The memory allocator 122 is customizableto efficiently handle a set of different request size distributions. Thememory allocator 122, at step 806, allocates a set of main memoryobjects. The intelligent memory manager 120, at step 806, backs up,utilizing a backup operation, the set of main memory objects that havebeen allocated in a persistent storage. The intelligent memory manager120, at step 808, monitors input-output bandwidth being consumed forstoring information in the persistent storage. The intelligent memorymanager 120, at step 812, modifies the backup operation based onmonitoring the bandwidth being consumed. The control flow then exits at814.

FIG. 9 is an operational flow diagram illustrating yet another exampleof managing computer memory, as discussed above. The operational flow ofFIG. 9 begins at step 902 and flows directly into step 904. Theintelligent memory manager 120, at step 904, initializes a memoryallocator. The intelligent memory manager 120, at step 906, deploys thememory allocator on a multi-user system where users are charged amonetary fee based on consumption of resources thereby. The memoryallocator 120, at step 908, determines a consumption of at least one ofa set of memory resources or a set of persistent storage resources by auser. The memory allocator 135, at step 910, determines a costassociated with the consumption that has been determined. Theintelligent memory manager 120, at step 912, determines a monetary feeto charge the user based on the cost that has been determined. Thecontrol flow then exits at step 914.

Although various embodiments of the invention have been disclosed, thosehaving ordinary skill in the art will understand that changes can bemade to the various embodiments without departing from the spirit andscope of the invention. The scope of the invention is not to berestricted, therefore, to the various embodiments, and it is intendedthat the appended claims cover any and all such applications,modifications, and embodiments within the scope of the presentinvention.

Although various example embodiments of the present invention have beendiscussed in the context of a fully functional computer system, those ofordinary skill in the art will appreciate that various embodiments arecapable of being distributed as a computer readable storage medium or aprogram product via CD or DVD, e.g. CD, CD-ROM, or other form ofrecordable media, and/or according to alternative embodiments via anytype of electronic transmission mechanism.

What is claimed is:
 1. A method for managing computer memory, the methodcomprising: initializing a plurality of memory allocators within acomputing system, wherein at least a first memory allocator and a secondmemory allocator in the plurality of memory allocators are eachcustomizable to efficiently handle a set of different memory requestsize distributions; customizing the first memory allocator toefficiently handle a first memory request size distribution determinedby the computing system; customizing the second memory allocator toefficiently handle a second memory request size distribution determinedby the computing system, the second memory request size distributionbeing different than the first memory request size distribution; anddeploying at least the first memory allocator and the second memoryallocator in support of at least one application, the deployingimproving at least one of performance and memory utilization of the atleast one application.
 2. The method of claim 1, further comprising:storing a plurality of memory objects by at least one memory allocatorin the plurality of memory allocators.
 3. The method of claim 2, furthercomprising: determining that the plurality of memory objects that havebeen stored are no longer required; and de-allocating, in response tothe determining, memory corresponding to the memory allocator.
 4. Themethod of claim 1, further comprising: backing up a main memory objectin a persistent storage.
 5. The method of claim 4, wherein the backingup is performed after a value associated with the main memory object haschanged.
 6. The method of claim 4, wherein the backing up is performedin response to determining that a version of the main memory objectstored within the persistent storage has been obsolete for a time periodexceeding a threshold.
 7. The method of claim 4, wherein the backing upis performed in response to a number of updates to the main memoryobject, since a most recent version of the main memory object was storedin the persistent storage, exceeding a threshold.
 8. The method of claim4, wherein the persistent storage comprises one of a file system anddatabase management system.
 9. The method of claim 1, wherein at leastone memory allocator in the plurality of memory allocators utilizes atleast one of: a first fit memory management method; a best fitmanagement method; a multiple free list fit I management method; amultiple free list fit II management method; a quick fit managementmethod; and a buddy system management method.